The processor takes care of much of the basic coding such as looping and passing parameters to implement a depth - first search ,可以看出處理程序處理了很多基本代碼(比如循環(huán)和傳遞參數(shù)) ,以便實現(xiàn)深度優(yōu)先的搜索。
In the algorithm , a way of graphical depth - first searching was used for tasks grouping , and then a series of heuristic rules were applied to select the proper group for assignment 該算法利用圖深度優(yōu)先搜索方法,將任務進行歸組,然后運用一系列啟發(fā)式規(guī)則對組進行選擇分配。
At the end , basing on comparative model , using depth - first search strategy and special arithmetic in the principle of mathematical equipollence , ides can auto distinguish the subject after comparing key steps and answering steps of student 基于比較模型,采用深度優(yōu)先的控制策略,采用特定算法,按照數(shù)學意義上等價的原則,對關鍵步驟和學生解答進行比較識別,從而實現(xiàn)自動批改功能。
百科解釋
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.